Search results for "Instance-based learning"
showing 5 items of 5 documents
Learning from good examples
1995
The usual information in inductive inference for the purposes of learning an unknown recursive function f is the set of all input /output examples (n,f(n)), n ∈ ℕ. In contrast to this approach we show that it is considerably more powerful to work with finite sets of “good” examples even when these good examples are required to be effectively computable. The influence of the underlying numberings, with respect to which the learning problem has to be solved, to the capabilities of inference from good examples is also investigated. It turns out that nonstandard numberings can be much more powerful than Godel numberings.
Class Noise and Supervised Learning in Medical Domains: The Effect of Feature Extraction
2006
Inductive learning systems have been successfully applied in a number of medical domains. It is generally accepted that the highest accuracy results that an inductive learning system can achieve depend on the quality of data and on the appropriate selection of a learning algorithm for the data. In this paper we analyze the effect of class noise on supervised learning in medical domains. We review the related work on learning from noisy data and propose to use feature extraction as a pre-processing step to diminish the effect of class noise on the learning process. Our experiments with 8 medical datasets show that feature extraction indeed helps to deal with class noise. It clearly results i…
Implicit learning
2008
International audience; All of us have learned much about language, music, physical or social environment, and other complex domains, out of any intentional attempts to acquire information. This chapter describes first how studies investigating this form of learning in laboratory situations have shifted from a rule-based interpretation to interpretations assuming a progressive tuning to the statistical regularities of the environment. The next section examines the potential of statistical learning, and whether statistical learning stems from statistical computations or chunk formation. Then the acceptations in which this form of learning may be qualified as implicit are analysed. Finally, i…
On the impact of forgetting on learning machines
1995
People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…
Real-time recognition of personal routes using instance-based learning
2011
Predicting routes is a critical enabler for many new location-based applications and services, such as warning drivers about congestion- or accident-risky areas. Hybrid vehicles can also utilize the route prediction for optimizing their charging and discharging phases. In this paper, a new lightweight route recognition approach using instance-based learning is introduced. In this approach, the current route is compared in real-time against the route instances observed in past, and the most similar route is selected. In order to assess the similarity between the routes, a similarity measure based on the longest common subsequence (LCSS) is employed, and an algorithm for incrementally evaluat…